The joint embedding property and maximal models
نویسندگان
چکیده
منابع مشابه
The joint embedding property and maximal models
We introduce the notion of a ‘pure’ Abstract Elementary Class to block trivial counterexamples. We study classes of models of bipartite graphs and show: Main Theorem (cf. Theorem 3.5.2 and Corollary 3.5.6): If 〈λi : i ≤ α < א1〉 is a strictly increasing sequence of characterizable cardinals (Definition 2.1) whose models satisfy JEP(< λ0), there is an Lω1,ω-sentence ψ whose models form a pure AEC...
متن کاملThe Joint Embedding Property in Normal Open Induction
The models of normal open induction are those discretely ordered rings, integrally closed in their fraction field whose nonnegative part satisfy Peano’s induction axioms for open formulas in the language of ordered semirings. It is known that neither open induction nor the usually studied stronger fragments of arithmetic (where induction for quantified formulas is allowed), have the joint embed...
متن کاملJoint Embedding Models for Textual and Social Analysis
In online social networks, users openly interact, share content, and endorse each other. Although the data is interconnected, previous research has primarily focused on modeling the social network behavior separately from the textual content. Here we model the data in a holistic way, taking into account connections between social behavior and content. Specifically, we define multiple decision t...
متن کاملA Note on the Joint Embedding Property in Fragments of Arithmetic
It is known that full Peano Arithmetic does not have the joint embedding property (JEP). At the other extreme of the hierarchy, Open Induction also fails to have this property. We prove, using some conservation results about fragments of arithmetic, that if T is a theory consistent with PA and T\IE^ (bounded existential parameter-free induction), then any two models of PA which jointly embed in...
متن کاملJoint Embedding of Graphs
Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a method to jointly embed multiple undirected graphs. Given a set of graphs, the joint embedding method identifies a linear subspace spanned by rank one symmetr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2016
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-016-0480-0